A Modified Penalty Embedding for Linear Complementarity Problems
نویسنده
چکیده
ABSTRACT We propose a modified penalty embedding for solving complementarity problem (LCP). This embedding is a special one parametric optimization problem P(t), t∈[0,1]. Under the condition (A3) (a modified Enlarged Mangasarian Fromovitz Constrait Qualification), (A4) (P(t) is JongenJonker -Twilt regular) and two technical assumptions (A1) and (A2) there exists a path in the set of stationary points connecting the chosen starting point for P(0) with a certain point for P(1) and this point is a solution for (LCP). The path may include types of singularities, namely points of Type 2, Type 3 and Type 4 in the class of Jongen-Jonker-Twilt. We can follow this path by using pathfollowing procedures (program package PAFO) only. We do not have any assumption with respect to the matrix B in the description of the (LCP). The assumption (A4) will justified by two theorems. An illustrative example shows that points of Type 2 and 3 could appear.
منابع مشابه
Improved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملA Penalty Technique for Nonlinear Complementarity Problems
In this paper, we first give a new equivalent optimization form to nonlinear complementarity problems and then establish a damped Newton method in which penalty technique is used. The subproblems of the method are lower-dimensional linear complementarity problems. We prove that the algorithm converges globally for strongly monotone complementarity problems. Under certain conditions, the method ...
متن کاملA power penalty method for linear complementarity problems
In this paper we propose a power penalty approach to linear complementarity problems (LCP) in a finite dimensional space. This approach is based on approximating the LCP by a nonlinear equation with a power penalty term. We prove that the solution to this equation converges to that of the LCP at a rate equivalent to the reciprocal of the power used in the penalty term when the penalty parameter...
متن کاملNonnegative least squares solution in inequality sense via LCP reformulation
In this paper, a monotone linear complementarity reformulation of the nonnegative least squares problems in inequality sense is introduced. Then Mehrotra’s predictor-corrector interior point algorithm is applied to solve the resulting monotone linear complementarity problem. Our numerical experiments on several randomly generated test problems show that Mehrotra’s algorithm overperforms the wid...
متن کاملA Quadratically Convergent Interior-Point Algorithm for the P*(κ)-Matrix Horizontal Linear Complementarity Problem
In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.
متن کامل